The Affine Hull of a Binary Automaton is Computable in Polynomial Time
نویسندگان
چکیده
منابع مشابه
The Affine Hull of a Binary Automaton is Computable in Polynomial Time
We present the class of binary automaton, a new representation for the subsets of N that naturally extends the NDD ([25], [10]). We prove that the affine hull of the set of vectors represented by a binary automaton is computable in polynomial time. As application, we show that the set of place invariants [11] of a counter system (an extension of the Broadcast Protocols [16], [13], [12], the Res...
متن کاملPolynomial time computable real functions
In this paper, we study computability and complexity of real functions. We extend these notions, already defined for functions over closed intervals or over the real line to functions over particular real open sets and give some results and characterizations, especially for polynomial time computable functions. Our representation of real numbers as sequences of rational numbers allows us to imp...
متن کاملOn Polynomial Time Computable Numbers
The computable numbers have already appeared in Turing’s paper [6] in which he defined the Turing machine. Turing defined them in real numbers, the definition is naturally extended to complex numbers. Rice showed that the whole complex computable numbers forms an algebraically closed field [4]. The field is strictly larger than the algebraic number fields Q since it contains transcendental numb...
متن کاملa time-series analysis of the demand for life insurance in iran
با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند
Shortest Consistent Superstrings Computable in Polynomial Time
The shortest consistent superstring problem is, given a set of positive strings and a set of negative strings, finding a shortest string including every positive string and no negative string as a substrin& This problem is NP-hard and arises in DNA sequencing by hybridization. It is also an extension of the well-known shortest cotillion superstring problem which corresponds to the case when the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2003.10.007